Monitoring progress with dynamic programming envelopes

نویسندگان

  • Robert St. Amant
  • Yoshitaka Kuwata
  • Paul R. Cohen
چکیده

Envelopes are a form of decision rule for monitoring plan execution. We describe one type, the DP envelope, that draws its decisions from a look-up table computed o -line by dynamic programming. Based on an abstract model of agent progress, DP envelopes let a developer approach execution monitoring as a problem independent of issues in agent design. We discuss the application of DP envelopes to a small transportation planning simulation, and discuss the issues that arise in an empirical analysis of the results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The progress mechanism of track geometrical irregularity focusing on hanging sleepers

This topic is very traditional and basically has been concerned for a long time. A lot of sophisticated vehicle/track interaction model and track dynamic deterioration model have been developed so far. The author also developed a track settlement progress model comprising a vehicle/track interaction model and a track settlement law. Hanging sleepers are usually caused more or less by the dyn...

متن کامل

Stochastic dual dynamic programming applied to nonconvex hydrothermal models

In this paper we apply stochastic dual dynamic programming decomposition to a nonconvex multistage stochastic hydrothermal model where the nonlinear water head effects on production and the nonlinear dependence between the reservoir head and the reservoir volume are modeled. The nonconvex constraints that represent the production function of a hydro plant are approximated by McCormick envelopes...

متن کامل

Stochastic Dynamic Programming with Markov Chains for Optimal Sustainable Control of the Forest Sector with Continuous Cover Forestry

We present a stochastic dynamic programming approach with Markov chains for optimal control of the forest sector. The forest is managed via continuous cover forestry and the complete system is sustainable. Forest industry production, logistic solutions and harvest levels are optimized based on the sequentially revealed states of the markets. Adaptive full system optimization is necessary for co...

متن کامل

An Optimal Tax Relief Policy with Aligning Markov Chain and Dynamic Programming Approach

Abstract In this paper, Markov chain and dynamic programming were used to represent a suitable pattern for tax relief and tax evasion decrease based on tax earnings in Iran from 2005 to 2009. Results, by applying this model, showed that tax evasion were 6714 billion Rials**. With 4% relief to tax payers and by calculating present value of the received tax, it was reduced to 3108 billion Rials. ...

متن کامل

Bankruptcy Prediction: Dynamic Geometric Genetic Programming (DGGP) Approach

 In this paper, a new Dynamic Geometric Genetic Programming (DGGP) technique is applied to empirical analysis of financial ratios and bankruptcy prediction. Financial ratios are indeed desirable for prediction of corporate bankruptcy and identification of firms’ impending failure for investors, creditors, borrowing firms, and governments. By the time, several methods have been attempted in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • International Journal on Artificial Intelligence Tools

دوره 5  شماره 

صفحات  -

تاریخ انتشار 1995